Photonics based perfect secrecy cryptography: Toward fully classical implementations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Foundations of Cryptography: Investigation of Perfect Secrecy 1

In the spirit of Shannon's theory of secrecy systems we analyse several possible natural deenitons of the notion of perfect secrecy; these deenitions are based on arguments taken from probability theory, information theory, the theory of computational complexity, and the theory of program-size complexity or algorithmic information. It turns out that none of these deenitions models the intuitive...

متن کامل

Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources

Cryptographic protocols are commonly designed and their security proven under the assumption that the protocol parties have access to perfect (uniform) randomness. Physical randomness sources deployed in practical implementations of these protocols often fall short in meeting this assumption, but instead provide only a steady stream of bits with certain high entropy. Trying to ground cryptograp...

متن کامل

Perfect Secrecy and Statistical

There are two key properties of the above. First, given only c, Eve should not be able to learn what m is. Second, Dec(Enc(m)) = m, so that Bob can accurately determine the message that Alice wanted to send. Creating functions Enc and Dec which satisfy this is a fundamental problem of cryptography. But given the above encryption scheme, knowing what these functions are is enough for anyone to d...

متن کامل

Perfect Secrecy and Adversarial Indistinguishability

Claude Shannon introduced an entropy model for information, and applied it to secrecy in communications. It supposes a source of information, Alice, which chooses among a set of possible messages. There is associated with this choice a likelihood that Alice would chose a particular message. Symbols are then sent across a channel to Bob. These symbols should refine Bob’s likelihood function, emp...

متن کامل

Perfect Secrecy and Provable Security

Everyone knows that the one-time pad provides perfect security. But what does this mean? In this chapter, we make this concept precise. Also, we know that it is very difficult in practice to produce a truly random key for a one-time pad. In Section 2, we show quantitatively how biases in producing the key affect the security of the encryption. The topics of this chapter are part of the subject ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Physics Letters

سال: 2020

ISSN: 0003-6951,1077-3118

DOI: 10.1063/5.0010744